Stable Source Connection and Assignment Problems as Multi-Period Shortest Path Problems
نویسندگان
چکیده
منابع مشابه
Random assignment and shortest path problems
The purpose of this article is to bring together some results on random assignment and shortest path problems, and to clarify how they relate to each other. In particular, we investigate the consequences of the two very different and hard proofs of the ζ(2) limit theorem for the random assignment problem given by David Aldous [1] and by Chandra Nair, Balaji Prabhakar and Mayank Sharma [11]. The...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملMulti-objective and multi-constrained non-additive shortest path problems
Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose of this paper is to give a general framework for dominance tests for problems involving a number of non...
متن کاملRobust shortest path problems
This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those com...
متن کاملRecoverable robust shortest path problems
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed. We investigate two settings of recoverable robust shortest path problems. In both settings the costs of the arcs are subject to uncertainty. For the first setting, at most k arcs of the chosen path can be altered in the recovery. In the second set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2020
ISSN: 1556-5068
DOI: 10.2139/ssrn.3678601